Local Fourier Analysis of Multigrid for the Curl-Curl Equation
نویسندگان
چکیده
We present a local Fourier analysis of multigrid methods for the two-dimensional curl-curl formulation of Maxwell's equations. Both the hybrid smoother proposed by Hiptmair and the overlapping block smoother proposed by Arnold, Falk and Winther are considered. The key to our approach is the identification of two-dimensional eigenspaces of the discrete curl-curl problem by decou-pling the Fourier modes for edges with different orientations. Our analysis allows to quantify the smoothing properties of the considered smoothers and the convergence behavior of the considered multigrid methods. Additionally, we identify the Helmholtz splitting in Fourier space. This allows to recover several well known properties in Fourier space, such as the commutation properties of the classical Nédélec prolongator and the equivalence of the curl-curl operator and the vector Laplacian for divergence-free vectors. We show how the approach used in this paper can be generalized to two-and three-dimensional problems in H(curl) and H(div) and to other types of regular meshes. 1. Introduction. The convergence of iterative methods for linear systems that arise from the discretization of a partial differential equation (PDE) can often be studied in a model problem setting by means of Fourier modes. In a local Fourier analysis (LFA) or local mode analysis, an infinite, regular grid is considered and boundary conditions are not taken into account. This type of analysis was introduced in [5]. It has been applied successfully to iterative solvers for several types of PDEs, such as the diffusion equation, the convection-diffusion equation, the Helmholtz equation, the biharmonic equation, the Stokes equations, the Oseen equations and elasticity. For comprehensive surveys, we refer the reader to [13, 15, 14]. In this paper, we develop a LFA for some multigrid methods for the curl-curl equation
منابع مشابه
Local Fourier analysis for multigrid with overlapping smoothers applied to systems of PDEs
Since their popularization in the late 1970s and early 1980s, multigrid methods have been a central tool in the numerical solution of the linear and nonlinear systems that arise from the discretization of many PDEs. In this paper, we present a local Fourier analysis (LFA, or local mode analysis) framework for analyzing the complementarity between relaxation and coarse-grid correction within mul...
متن کاملUniform Convergence of Local Multigrid Methods for the Time-harmonic Maxwell Equation
For the efficient numerical solution of indefinite linear systems arising from curl conforming edge element approximations of the time-harmonic Maxwell equation, we consider local multigrid methods (LMM) on adaptively refined meshes. The edge element discretization is done by the lowest order edge elements of Nédélec's first family. The LMM features local hybrid Hiptmair smoothers of Jacobi and...
متن کاملAlgebraic Multigrid for High-Order Hierarchical H(curl) Finite Elements
Classic multigrid methods are often not directly applicable to nonelliptic problems such as curl-type partial differential equations (PDEs). Curl-curl PDEs require specialized smoothers that are compatible with the gradient-like (near) null space. Moreover, recent developments have focused on replicating the grad-curl-div de Rham complex in a multilevel hierarchy through smoothed aggregation ba...
متن کاملDifferential geometry and multigrid for the div-grad, curl-curl and grad-div equations
This paper is concerned with the application of principles of differential geometry in multigrid for the div-grad, curl-curl and grad-div equations. First, the discrete counterpart of the formulas for edge, face and volume elements are used to derive a sequence of a commuting edge, face and volume prolongator from an arbitrary partition of unity nodal prolongator. The implied coarse topology an...
متن کاملParallel 3 D Maxwell Solvers based on Domain Decomposition Data Distribution
The most efficient solvers for finite element (fe) equations are certainly multigrid, or multilevel methods, and domain decomposition methods using local multigrid solvers. Typically, the multigrid convergence rate is independent of the mesh size parameter, and the arithmetical complexity grows linearly with the number of unknowns. However, the standard multigrid algorithms fail for the Maxwell...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- SIAM J. Scientific Computing
دوره 30 شماره
صفحات -
تاریخ انتشار 2008